Iterative methods for multiple zeros of a polynomial by clustering
نویسندگان
چکیده
منابع مشابه
Semilocal Convergence of Two Iterative Methods for Simultaneous Computation of Polynomial Zeros
In this paper we study some iterative methods for simultaneous approximation of polynomial zeros. We give new semilocal convergence theorems with error bounds for Ehrlich’s and Nourein’s iterations. Our theorems generalize and improve recent results of Zheng and Huang [J. Comput. Math. 18 (2000), 113– 122], Petković and Herceg [J. Comput. Appl. Math. 136 (2001), 283–307] and Nedić [Novi Sad J. ...
متن کاملSimultaneous Methods for Finding All Zeros of a Polynomial
The purpose of this paper is to present three new methods for finding all simple zeros of polynomials simultaneously. First, we give a new method for finding simultaneously all simple zeros of polynomials constructed by applying the Weierstrass method to the zero in the trapezoidal Newton’s method, and prove the convergence of the method. We also present two modified Newton’s methods combined w...
متن کاملA Two-Parameter Family of Fourth-Order Iterative Methods with Optimal Convergence for Multiple Zeros
We develop a family of fourth-order iterative methods using the weighted harmonic mean of two derivative functions to compute approximatemultiple roots of nonlinear equations.They are proved to be optimally convergent in the sense of Kung-Traub’s optimal order. Numerical experiments for various test equations confirm well the validity of convergence and asymptotic error constants for the develo...
متن کاملInequalities for the polar derivative of a polynomial with $S$-fold zeros at the origin
Let $p(z)$ be a polynomial of degree $n$ and for a complex number $alpha$, let $D_{alpha}p(z)=np(z)+(alpha-z)p'(z)$ denote the polar derivative of the polynomial p(z) with respect to $alpha$. Dewan et al proved that if $p(z)$ has all its zeros in $|z| leq k, (kleq 1),$ with $s$-fold zeros at the origin then for every $alphainmathbb{C}$ with $|alpha|geq k$, begin{align*} max_{|z|=...
متن کاملMultivariate polynomial equations with multiple zeros solved by matrix eigenproblems
The eigenproblem method calculates the solutions of systems of polynomial equations f1(x1, . . . , xs) = 0, . . . , fm(x1, . . . , xs) = 0. It consists in fixing a suitable polynomial f and in considering the matrix Af corresponding to the mapping [p] 7→ [f · p] where the equivalence classes are modulo the ideal generated by f1, . . . , fm. The eigenspaces contain vectors, from which all soluti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational and Applied Mathematics
سال: 1989
ISSN: 0377-0427
DOI: 10.1016/0377-0427(89)90343-9